Solving the Balance Problem of On-Line Role-Playing Games Using Evolutionary Algorithms
نویسندگان
چکیده
منابع مشابه
Solving the Balance Problem of On-Line Role-Playing Games Using Evolutionary Algorithms
In on-line role-playing games (RPG), each race holds some attributes and skills. Each skill contains several abilities such as physical damage, hit rate, etc. Parts of the attributes and all the abilities are a function of the character’s level, which are called Ability-Increasing Functions (AIFs). A well-balanced on-line RPG is characterized by having a set of well-balanced AIFs. In this paper...
متن کاملSolving the Economic Load Dispatch Problem Considering Units with Different Fuels Using Evolutionary Algorithms
Nowadays, economic load dispatch between generation units with least cost involved is one of the most important issues in utilizing power systems. In this paper, a new method i.e. Water Cycle Algorithm (WCA) which is similar to other intelligent algorithm and is based on swarm, is employed in order to solve the economic load dispatch problem between power plants. In order to investigate the eff...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولsolving the economic load dispatch problem considering units with different fuels using evolutionary algorithms
nowadays, economic load dispatch between generation units with least cost involved is one of the most important issues in utilizing power systems. in this paper, a new method i.e. water cycle algorithm (wca) which is similar to other intelligent algorithm and is based on swarm, is employed in order to solve the economic load dispatch problem between power plants. in order to investigate the eff...
متن کاملA Competitive Markov Approach to the Optimal Combat Strategies of On-Line Action Role-Playing Game Using Evolutionary Algorithms
In the case of on-line action role-playing game, the combat strategies can be divided into three distinct classes, Strategy of Motion(SM), Strategy of Attacking Occasion (SAO) and Strategy of Using Skill (SUS). In this paper, we analyze such strategies of a basic game model in which the combat is modeled by the discrete competitive Markov decision process. By introducing the chase model and the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Software Engineering and Applications
سال: 2012
ISSN: 1945-3116,1945-3124
DOI: 10.4236/jsea.2012.58066